- complexity theoretic security
- безопасность или система безопасности, основанная на теории сложности
Англо-русский словарь по компьютерной безопасности. Академик.ру. 2011.
complexity theoretic security
Смотреть что такое "complexity theoretic security" в других словарях:
Private information retrieval — In cryptography, a private information retrieval (PIR) protocol allows a user to retrieve an item from a server in possession of a database without revealing which item she is retrieving. PIR is a weaker version of 1 out of n oblivious transfer,… … Wikipedia
Information theory — Not to be confused with Information science. Information theory is a branch of applied mathematics and electrical engineering involving the quantification of information. Information theory was developed by Claude E. Shannon to find fundamental… … Wikipedia
Computational hardness assumption — In cryptography, a major goal is to create cryptographic primitives with provable security. In some cases cryptographic protocols are found to have information theoretic security, the one time pad is a common example. In many cases, information… … Wikipedia
Cryptography — Secret code redirects here. For the Aya Kamiki album, see Secret Code. Symmetric key cryptography, where the same key is used both for encryption and decryption … Wikipedia
List of computer science conferences — This is a list of academic conferences in computer science. Most of these academic conferences are annual or bi annual events.The order with which the conferences are listed in their respective fields corresponds to a rough and non authoritative… … Wikipedia
Computational trust — In Information security, computational trust is the generation of trusted authorities or user trust through cryptography. In centralised systems, security is typically based on the authenticated identity of external parties. Rigid authentication… … Wikipedia
Denotational semantics — In computer science, denotational semantics (initially known as mathematical semantics or Scott–Strachey semantics) is an approach to formalizing the meanings of programming languages by constructing mathematical objects (called denotations)… … Wikipedia
Naor-Reingold Pseudorandom Function — In 1997, Moni Naor and Omer Reingold described efficient constructions for various cryptographic primitives in private key as well as public key cryptography. Their result is the construction of an efficient pseudorandom function. Let p and l be… … Wikipedia
Leonard Adleman — (* 31. Dezember 1945 in San Francisco) ist Professor für Informatik und Molekularbiologie an der University of Southern California in Los Angeles. Für die Entwicklung des RSA Algorithmus erhielt er im Jahr 20 … Deutsch Wikipedia
Democratic peace theory — (or liberal democratic theory[1] or simply the democratic peace ) is the theory that democracies, for some appropriate definition of democracy, rarely, or even never, go to war with one another. Some have preferred the term inter democracy… … Wikipedia
Quantum entanglement — Quantum mechanics Uncertainty principle … Wikipedia
